Pattern Matching of Colored Point Sets in 3d

نویسندگان

  • Marko Boben
  • Alen Orbanić
  • Tomaž Pisanski
  • Ante Graovac
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noisy Bottleneck Colored Point Set Matching in 3D

In this paper we tackle the problem of matching two colored point sets in R under the bottleneck distance. First we present an exact matching algorithm that requires the computation of intersections of complex algebraic surfaces. To avoid this, we also present an approximate algorithm that is implementable and has improved asymptotic cost at the price of having the risk of ”missing” some soluti...

متن کامل

3D point pattern matching based on spatial geometric flexibility

We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises from marker based optical motion capture (Mocap) systems for facial Mocap data. To establish one-to-one identifications, we introduce a forward 3D point pattern matching (PPM) method based on spatial geometric flexib...

متن کامل

3D Classification of Urban Features Based on Integration of Structural and Spectral Information from UAV Imagery

Three-dimensional classification of urban features is one of the important tools for urban management and the basis of many analyzes in photogrammetry and remote sensing. Therefore, it is applied in many applications such as planning, urban management and disaster management. In this study, dense point clouds extracted from dense image matching is applied for classification in urban areas. Appl...

متن کامل

Colored Point Set Matching Under Noise in 3D

Let A and B be two colored points sets in R, with |A| ≤ |B|. We propose a process for determining matches, in terms of the bottleneck distance, between A and subsets of B under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. Our algorithm consists of two main stages. In the first one we generate all, up to a cert...

متن کامل

Using k-d Trees for Robust 3D Point Pattern Matching

We propose a new method for matching two 3D point sets of identical cardinality with global similarity but locally non-rigid distribution. This problem arises from markerbased optical motion capture systems. The point-sets are extracted from similar design poses of two subjects with underlying non-rigidity and possible distribution discrepancies, one being a model set (manually identified) and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009